Tree-like decompositions and conformal maps
نویسندگان
چکیده
منابع مشابه
Tree-like Decompositions and Conformal Maps
Any simply connected rectifiable domain Ω can be decomposed into uniformly chord-arc subdomains using only crosscuts of the domain. We show that such a decomposition allows one to construct a map from Ω to the disk which is close to conformal in a uniformly quasiconformal sense. This answers a question of Stephen Vavasis. 1991 Mathematics Subject Classification. Primary: 30C35 Secondary: 30C30,...
متن کاملTree-like Decompositions of Simply Connected Domains
We show that any simply connected rectifiable domain Ω can be decomposed into Lipschitz crescents using only crosscuts of the domain and using total length bounded by a multiple of the length of ∂Ω. In particular, this gives a new proof of a theorem of Peter Jones that such a domain can be decomposed into Lipschitz disks. 1991 Mathematics Subject Classification. Primary: 68U05 Secondary: 26B15,...
متن کاملSimplicial Decompositions, Tree-decompositions and Graph Minors
The concepts of simplicial decompositions, tree-decompositions and simplicial tree-decompositions were all inspired by a common forerunner: the decompositions of finite graphs used by K. Wagner in his classic paper [ 13 ], in which he proved the equivalence of the 4-Colour-Conjecture to Hadwiger’s Conjecture for n = 5. To show that the 4CC implies Hadwiger’s Conjecture (for n = 5), Wagner used ...
متن کاملTree-decompositions and logic
Tree-width is a parameter that measures the similarity of a graph or relational structure with a tree. Many NP-hard decision and optimization problems are solvable in polynomial time on classes of bounded tree-width. A general theorem due to Courcelle states that this is the case for all problems that are definable in monadic second-order logic. In this talk we will introduce the concept of tre...
متن کاملTree decompositions and social graphs
Recent work has established that large informatics graphs such as social and information networks have a nontrivial treelike structure when viewed at moderate-size scales. Here, we present results from the first detailed empirical evaluation of the use of tree decomposition (TD) heuristics for structure identification and extraction in social graphs. Although TDs have historically been used in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales Academiae Scientiarum Fennicae Mathematica
سال: 2010
ISSN: 1239-629X,1798-2383
DOI: 10.5186/aasfm.2010.3525